Naïve Matrix Multiplication versus Strassen Algorithm in Multi-thread Environment
نویسندگان
چکیده
Naivno množenje matrica In the first section, we will give mathematical reasoning of Strassen's alghoritm for matrix multiplication. First a naïve method for matrix multiplication is explained, and then it is extended to more advanced Strassen's method. In the following section a description of programming language and framework is given, with explanation of the algorithm's implementation. Last two sections present the result and explain some interesting points with regard to the results.
منابع مشابه
Decoding Generalized Reed-Solomon Codes and Its Application to RLCE Encryption Scheme
This paper compares the efficiency of various algorithms for implementing public key encryption scheme RLCE on 64-bit CPUs. By optimizing various algorithms for polynomial and matrix operations over finite fields, we obtained several interesting (or even surprising) results. For example, it is well known (e.g., Moenck 1976 [13]) that Karatsuba’s algorithm outperforms classical polynomial multip...
متن کاملDecoding Generalized Reed-Solomon Codes and Its Application to RLCE Encryption Schemes
This paper compares the efficiency of various algorithms for implementing quantum resistant public key encryption scheme RLCE on 64-bit CPUs. By optimizing various algorithms for polynomial and matrix operations over finite fields, we obtained several interesting (or even surprising) results. For example, it is well known (e.g., Moenck 1976 [13]) that Karatsuba’s algorithm outperforms classical...
متن کاملMatrix Multiplication on High-Density Multi-GPU Architectures: Theoretical and Experimental Investigations
Matrix multiplication (MM) is one of the core problems in the high performance computing domain and its efficiency impacts performances of almost all matrix problems. The high-density multi-GPU architecture escalates the complexities of such classical problem, though it greatly exceeds the capacities of previous homogeneous multicore architectures. In order to fully exploit the potential of suc...
متن کاملA Divide-and-Conquer Strategy and PVM Computation Environment for the Matrix Multiplication
This paper deals with parallels of the fast matrix multiplication strassen's algorithm, winograd’s algorithm and analyzes empirical study of the matrix multiplication under the distributed environment in which PVM (Parallel Virtual Machine) environment is implemented. The contribution of this paper is that the parallelism of matrix-matrix multiplication need personal computer (or workstation cl...
متن کاملLaderman matrix multiplication algorithm can be constructed using Strassen algorithm and related tensor's isotropies
In 1969, V. Strassen improves the classical~2x2 matrix multiplication algorithm. The current upper bound for 3x3 matrix multiplication was reached by J.B. Laderman in 1976. This note presents a geometric relationship between Strassen and Laderman algorithms. By doing so, we retrieve a geometric formulation of results very similar to those presented by O. Sykora in 1977.
متن کامل